Pseudo completions and completions in stages of o-minimal structures
نویسندگان
چکیده
منابع مشابه
Pseudo completions and completions in stages of o-minimal structures
For an o-minimal expansion R of a real closed field and a set V of Th(R)-convex valuation rings, we construct a “pseudo completion” with respect to V . This is an elementary extension S of R generated by all completions of all the residue fields of the V ∈ V , when these completions are embedded into a big elementary extension of R. It is shown that S does not depend on the various embeddings u...
متن کاملPseudo Completions and Completion in
For an o-minimal expansion R of a real closed eld and a set V of Th(R)-convex valuation rings, we construct a \pseudo completion" with respect to V. This is an elementary extension S of R generated by all completions of all the residue elds of the V 2 V , when these completions are embedded into a big elementary extension of R. It is shown that S does not depend on the various embeddings up to ...
متن کاملMinimal Interval Completions
We study the problem of adding edges to an arbitrary graph so that the resulting graph is an interval graph. Our objective is to add an inclusion minimal set of edges, which means that no proper subset of the added edges can result in an interval graph when added to the original graph. This problem is closely related to the problem of adding an inclusion minimal set of edges to a graph to obtai...
متن کاملMinimal comparability completions
We study the problem of adding edges to a given arbitrary graph so that the resulting graph is a comparability graph, called a comparability completion of the input graph. Computing a comparability completion with the minimum possible number of added edges is an NP-hard problem. Our purpose here is to add an inclusion minimal set of edges to obtain a minimal comparability completion, which mean...
متن کاملMinimal split completions
We study the problem of adding an inclusion minimal set of edges to a given arbitrary graph so that the resulting graph is a split graph, called a minimal split completion of the input graph. Minimal completions of arbitrary graphs into chordal and interval graphs have been studied previously, and new results have been added recently. We extend these previous results to split graphs by giving a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Archive for Mathematical Logic
سال: 2006
ISSN: 0933-5846,1432-0665
DOI: 10.1007/s00153-006-0022-2